Implicit Routing and Shortest
نویسندگان
چکیده
We study the problem of constructing graphs from shortest path information (complete or partial). Consider graphs with labeled vertices and edges. Given a collection V of vertices and for each u 2 V a positive integer d(u), and a family F u = fF u;i : i < d(u)g of subsets of V construct a graph such that for each u and each link i of u, F u;i is the set of nodes having an optimal length path to u passing through link i. In the complete information case we show that a shortest path family uniquely determines the graph and conclude the existence of graphs such that any full information shortest path routing scheme requires a total of (n 2 ) memory bits. We also study the class of \unique shortest path graphs", i.e. graphs for which all vertices are connected by a unique shortest path. 1980 Mathematics Subject Classi cation: 68Q99 CR Categories: C.2.1
منابع مشابه
Routing Using Implicit Connection Graphs - VLSI Design, 1996. Proceedings., Ninth International Conference on
We introduce a framework for a class of algorithms solving shortest path related problems, such as the one-to-one shortest path problem, the one-to-many shortest paths pmblem and the minimum spanning tree problem, in the presence of obstacles. For these algorithms, the search space is restricted to a sparse strong connection graph which is implicitly represented and its searched portion is cons...
متن کاملSome Notes and Results on Bandwidth-based Routing and Implicit Load Balancing
The Maximum Bandwidth Path Algorithm (MBPA) is introduced as an alternative to Dijkstra’s Shortest Path Algorithm (DSPA) for Internet routing. The two are compared and differences noted. Of particular interest is the extent to which each algorithm achieves Implicit Load Balancing (ILB) – the principle of effective link usage for traffic across the network as a whole for non-equal paths and with...
متن کاملA Novel Protection Guaranteed, Quality of Transmission Aware Routing and Wavelength Assignment Algorithm for All-optical Networks
Transparent All Optical Networks carry huge traffic and any link failure can cause the loss of gigabits of data; hence protection and its guarantee becomes necessary at the time of failure. Many protection schemes were presented in the literature, but none of them speaks about protection guarantee. Also, in all optical networks, due to absence of regeneration capabilities, the physical layer i...
متن کاملAn efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model
In this paper, we present a direct approach for routing a shortest rectilinear path between two points among a set of rectilinear obstacles in a two-layer interconnec-tion model. The previously best known direct approach for this problem takes O(n log 2 n) time and O(n log n) space. By using integer data structures and an implicit graph representation scheme, we reduce the time bound to O(n log...
متن کاملUsing a Fuzzy Rule-based Algorithm to Improve Routing in MPLS Networks
Today, the use of wireless and intelligent networks are widely used in many fields such as information technology and networking. There are several types of these networks that MPLS networks are one of these types. However, in MPLS networks there are issues and problems in the design and implementation discussion, for example security, throughput, losses, power consumption and so on. Basically,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013